Approximation schemes for the Min-Max Starting Time Problem
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for the Max-Min Allocation Problem
The Max-Min allocation problem is to distribute indivisible goods to people so as to maximize the minimum utility of the people. We show a (2k − 1)-approximation algorithm for Max-Min when there are k people with subadditive utility functions. We also give a k/α-approximation algorithm (for α ≤ k/2) if the utility functions are additive and the utility of an item for a person is restricted to 0...
متن کاملImproved Approximation Algorithms for the Min-Max Selecting Items Problem
We give a simple deterministic O(logK/ log logK) approximation algorithm for the Min-Max Selecting Items problem, where K is the number of scenarios. While our main goal is simplicity, this result also improves over the previous best approximation ratio of O(logK) due to Kasperski, Kurpisz, and Zieliński (Information Processing Letters (2013)). Despite using the method of pessimistic estimators...
متن کاملApproximation Algorithms for Min-Max Tree Partition
We consider the problem of partitioning the node set of a graph into p equal sized subsets. The objective is to minimize the maximum length, over these subsets, of a minimum spanning tree. We show that no polynomial algorithm with bounded Ž 2 . error ratio can be given for the problem unless P s NP. We present an O n time algorithm for the problem, where n is the number of nodes in the graph. A...
متن کاملPolynomial Time Approximation Schemes for Metric Min-Sum Clustering
We give polynomial time approximation schemes for the problem of partitioning an input set of n points into a xed number k of clusters so as to minimize the sum over all clusters of the total pairwise distances in a cluster. Our algorithms work for arbitrary metric spaces as well as for points in R d where the distance between two points x; y is measured by kx ? yk 2 2 (notice that (R d ; k k 2...
متن کاملApproximation algorithms for MAX-MIN tiling
The MAX-MIN tiling problem is as follows. We are given A[1, . . . , n][1, . . . , n], a two-dimensional array where each entry A[i][j ] stores a non-negative number. Define a tile of A to be a subarray A[ , . . . , r][t, . . . , b] of A, the weight of a tile to be the sum of all array entries in it, and a tiling of A to be a collection of tiles of A such that each entry A[i][j ] is contained in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Informatica
سال: 2004
ISSN: 0001-5903,1432-0525
DOI: 10.1007/s00236-004-0145-z